Superior Seclusion over Confirmation of K-Nearest Neighbor Enquiry on Spatial Network
نویسندگان
چکیده
Safety measure is budding to be a vital aspect to be taken into our mind due to the eternally altering earth of worldwide facts communications, low-priced Internet connections, and fast-budding technology development. One of the elementary prerequisite is security since many of world wide computing seems to be not secured. When the information takes a trip via Internet it has a wide variety of intermediate points and it gets easily hacked despite of many safety techniques. Generally a customer when screens for an particular data, the search section is the area where the customer enter his query for which the customer needs to get the particular data While surfing the customer information such as IP address of the customer, region of customer will be stored in the outside people owned server. Since many of the outside people owned servers does not provide elevated security for user information such as area when gets hacked by some unauthenticated person then it will cause several sufferings to the authorized customer. The key idea is to focus on the safekeeping of the user. Combination of Hilbert space filling transformation and Voronoi Network provide better results when compared with existing techniques in this domain. Keywords— Hilbert Curve, Voronoi Network, Hilbert filling Transformation.
منابع مشابه
Identification of selected monogeneans using image processing, artificial neural network and K-nearest neighbor
Abstract Over the last two decades, improvements in developing computational tools made significant contributions to the classification of biological specimens` images to their correspondence species. These days, identification of biological species is much easier for taxonomist and even non-taxonomists due to the development of automated computer techniques and systems. In this study, we d...
متن کاملFUZZY K-NEAREST NEIGHBOR METHOD TO CLASSIFY DATA IN A CLOSED AREA
Clustering of objects is an important area of research and application in variety of fields. In this paper we present a good technique for data clustering and application of this Technique for data clustering in a closed area. We compare this method with K-nearest neighbor and K-means.
متن کاملEstimation of Density using Plotless Density Estimator Criteria in Arasbaran Forest
Sampling methods have a theoretical basis and should be operational in different forests; therefore selecting an appropriate sampling method is effective for accurate estimation of forest characteristics. The purpose of this study was to estimate the stand density (number per hectare) in Arasbaran forest using a variety of the plotless density estimators of the nearest neighbors sampling me...
متن کاملAsymptotic Behaviors of Nearest Neighbor Kernel Density Estimator in Left-truncated Data
Kernel density estimators are the basic tools for density estimation in non-parametric statistics. The k-nearest neighbor kernel estimators represent a special form of kernel density estimators, in which the bandwidth is varied depending on the location of the sample points. In this paper, we initially introduce the k-nearest neighbor kernel density estimator in the random left-truncatio...
متن کاملEvaluation Accuracy of Nearest Neighbor Sampling Method in Zagross Forests
Collection of appropriate qualitative and quantitative data is necessary for proper management and planning. Used the suitable inventory methods is necessary and accuracy of sampling methods dependent the inventory net and number of sample point. Nearest neighbor sampling method is a one of distance methods and calculated by three equations (Byth and Riple, 1980; Cotam and Curtis, 1956 and Cota...
متن کامل